Information hiding based on double random-phase encoding and public-key cryptography
نویسندگان
چکیده
منابع مشابه
Efficient Text Encryption and Hiding with Double-Random Phase-Encoding
In this paper, a double-random phase-encoding technique-based text encryption and hiding method is proposed. First, the secret text is transformed into a 2-dimensional array and the higher bits of the elements in the transformed array are used to store the bit stream of the secret text, while the lower bits are filled with specific values. Then, the transformed array is encoded with double-rand...
متن کاملPartial Hiding in Public-Key Cryptography
This paper explores the idea of exposing sections of the private key in public-key cryptosystems whose security is based on the intractability of factorising large integers, such as RSA. While substantial work has been done in the area of partial key exposure, the aim has been to investigate the implications of inadvertant partial exposure of the private key. We focus instead on the potential a...
متن کاملRFID Privacy Based on Public-Key Cryptography
RFID systems makes it possible for a server to identify known tags in wireless settings. As they become more and more pervasive, people privacy is more and more threatened. In this talk, we list a few models for privacy in RFID and compare them. We review a few protocols. We further show that strong privacy mandates the use of public-key cryptography. Finally, we present a new cryptosystem whic...
متن کاملPublic Key Cryptography based on Semigroup Actions
A generalization of the original Diffie-Hellman key exchange in (Z/pZ) found a new depth when Miller [27] and Koblitz [16] suggested that such a protocol could be used with the group over an elliptic curve. In this paper, we propose a further vast generalization where abelian semigroups act on finite sets. We define a Diffie-Hellman key exchange in this setting and we illustrate how to build in...
متن کاملPublic-Key Cryptography Based on Modular Lattices
We present an approach to generalization of practical Identity-Based Encryption scheme of [BF01]. In particular we show how the protocol could be used on finite modular lattices and as a special case on vector spaces over finite field. The original proof of security for this protocol does not hold in this general algebraic structure, thus this is still a work in progress.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optics Express
سال: 2009
ISSN: 1094-4087
DOI: 10.1364/oe.17.003270